A Logarithmic Complexity Divide-and-conquer Algorithm Formulti-flexible Articulated Body Dynamics

نویسندگان

  • Rudranarayan M. Mukherjee
  • Kurt S. Anderson
چکیده

This paper presents an efficient algorithm for the parallel implementation of dynamics simulation and analysis of multi-flexible-body systems. This algorithm formulates and solves the nonlinear equations of motion for mechanical systems with interconnected flexible bodies subject to the limitations of modal superposition, and body substructuring, with arbitrarily large rotations and translations. The large rotations or translations are modelled as rigid body degrees of freedom associated with the interconnecting kinematic joint degrees of freedom. The elastic deformation of the component bodies is modelled through the use of modal coordinates and associated admissible shape functions. Apart from the approximation associated with the elastic deformations, this algorithm is exact, non-iterative and applicable to generalized multiflexible chain and tree topologies. In its basic form, the algorithm is both time and processor optimal in its treatment of the nb joint variables, providing O(log(nb)) turn around time per temporal integration step, achieved with O(nb) processors. The actual cost associated with the parallel treatment of the nf flexible degrees of freedom depends on the specific parallel method chosen for dealing with the inversion of the individual coefficient matrices which are associated locally with each flexible body. 1 To appear in ASME Journal of Computational and Nonlinear Dynamics Rudranarayan M. Mukherjee, Kurt S. Anderson r Position vector V Spatial velocity, a 6 × 1 column matrix A Spatial acceleration, a 6 × 1 column matrix ω Angular velocity v Translational velocity of a body reference point α Angular acceleration a Translational acceleration of a body reference point φ Admissible shape function for translational components of deformation ψ Admissible shape function for rotational components of deformation Φ Spatial matrix containing the shape functions [ ψ φ ] qi k i-th Modal Coordinate of a flexible body k q̇ k i Time derivative of i-th modal coordinate of a flexible body k q̈ k i Second time derivative of i-th modal coordinate of a flexible body k ρ Mass density ζ Inertia coupling terms for individual body or subassembly Υ Inertia coupling terms for assembly nb Number of bodies in the system ν Number of assumed mode shapes for a flexible body k H Joint motion subspace map of joint connecting body k+1 to body k D Orthogonal complement of H u Generalized relative speed u̇ Time derivative of generalized relative speed N ωr k+ r-th partial angular velocity of body k w.r.t frame N N vr k+ r-th partial velocity of body k w.r.t frame N P k r r-th spatial partial velocity of body k w.r.t frame N S Shift Matrix between joint k and k+1 [ U r× 0 U ] b× 3×3 skew symmetric matrix for cross product of any vector b C Transpose of any arbitrary matrix C Fc i Spatial constraint force at joint i τc i Constraint torque at joint i fc i Constraint force at joint i τ̃c i Measure numbers of constraint torque at joint i f̃c i Measure numbers of constraint force at joint i f Body force at point p k̂i Unit vector in direction i U 3× 3 Identity matrix 0 3× 3 Zero matrix φ|P φ evaluated at point P Table 1: The Nomenclature 2 To appear in ASME Journal of Computational and Nonlinear Dynamics

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Dynamics with Efficient Contact Handling for Articulated Robots

We present a novel adaptive dynamics algorithm with efficient contact handling for articulated robots. Our algorithm automatically computes a fraction of the joints whose motion provides a good approximation to overall robot dynamics. We extend Featherstone’s Divide-and-Conquer algorithm and are able to efficiently handle all contacts and collisions with the obstacles in the environment. Overal...

متن کامل

A divide-and-conquer direct differentiation approach for multibody system sensitivity analysis

In the design and analysis of multibody dynamics systems, sensitivity analysis is a critical tool for good design decisions. Unless efficient algorithms are used, sensitivity analysis can be computationally expensive, and hence, limited in its efficacy. Traditional direct differentiation methods can be computationally expensive with complexity as large as O(n4 + n2m2 + nm3), where n is the numb...

متن کامل

طراحی ساختاری به روشDivide & Conquer و کاربرد آن در طراحی سوئیچ MSC

This paper presents the structural design for huge systems using Divide & Conquer (D&C) method as a scientific method for optimum designing of complex systems. This method divides the main system into several simple subsystems. Submitted equations in three different cases prove that the optimum response (number of subsystems for minimum system complexity) is independent of main system complexit...

متن کامل

Vertical Dynamics Modeling and Simulation of a Six-Wheel Unmanned Ground Vehicle

Vertical dynamics modeling and simulation of a six-wheel unmanned military vehicle (MULE) studied in this paper. The Common Mobility Platform (CMP) chassis provided mobility, built around an advanced propulsion and articulated suspension system gave the vehicle ability to negotiate complex terrain, obstacles, and gaps that a dismounted squad would encounter. Aiming at modeling of vehicle vertic...

متن کامل

An Efficient Similarity Digests Database Lookup - A Logarithmic Divide & Conquer Approach

Investigating seized devices within digital forensics represents a challenging task due to the increasing amount of data. Common procedures utilize automated file identification, which reduces the amount of data an investigator has to examine manually. In the past years the research field of approximate matching arises to detect similar data. However, if n denotes the number of similarity diges...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006